1922E - Increasing Subsequences - CodeForces Solution

#include <bits/stdc++.h>
#define int long long
#define re(a, b, c, d) for (auto a = b; a <= c; a += d)
#define de(a, b, c, d) for (auto a = b; a >= c; a -= d)
#define ms (a); memset (a, 0, sizeof a);
#define imax INT_MAX
#define imin INT_MIN
#define wh(a) while (a --)
#define PII pair <int, int>
#define F first
#define S second
#define pb push_back
#define eb emplace_back
template <typename T> bool chkmin (T &a, T b) {
	return (b < a) ? a = b, 1 : 0;
}
template <typename T> bool chkmax (T &a, T b) {
	return (b > a) ? a = b, 1 : 0;
}
using namespace std;
int T, n, x;
signed main () {
	cout << fixed << setprecision (0);
	ios :: sync_with_stdio (0), cin.tie (0), cout.tie (0);
	cin >> T;
	wh (T) {
		cin >> x;
		vector <int> v;
		int l = 0, r = 10000;
		while (x > 1) {
			if (x & 1) v.pb (r --);
			v.pb (l ++);
			x >>= 1;
		}
		cout << v.size() << "\n";
		for (auto t : v) cout << t << " ";
		cout << "\n";
	}
	return 0;
}